Short note on complexity and approximability of unimodal partitions of permutations
نویسندگان
چکیده
We extend results of Wagner [8] and Fomin, Kratsch, and Novelle [6] on monotone partitions of permutations. We show that partitioning a sequence of distinct integers into unimodal subsequences is NP-complete and that a minimum unimodal partition is 3.42-approximable in polynomial time.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملA Survey on Partially Ordered Patterns
The paper offers an overview over selected results in the literature on partially ordered patterns (POPs) in permutations, words and compositions. The POPs give rise in connection with co-unimodal patterns, peaks and valleys in permutations, Horse permutations, Catalan, Narayana, and Pell numbers, bi-colored set partitions, and other combinatorial objects.
متن کاملOn Minimum k-Modal Partitions of Permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result to minimum partitioning into k-modal subsequences; here unimodal is the special case k = 1. Based on a network flow interpretation we formulate both, the monotone and the k-modal version, as mixed integer programs. This is the first proposal to obtain provably optimal partition...
متن کاملA Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis
Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...
متن کاملPermutations and Coin-Tossing Sequences
This quote is from Herbert Wilf's delightful book generatingfunctionology [1, p. 75]. It occurs in the chapter on the exponential formula, a powerful technique for counting labelled structures formed from "connected" components. Such structures include various types of graphs, permutations (formed from cycles), and partitions (a union of blocks). Applied to permutations on n letters comprising ...
متن کامل